Solving partially observable agent‐intruder games with an application to border security problems

In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results.     

雷达故障"板级定位"诊断系统的设计

为故障精确定位而设计的雷达故障诊断系统,利用VXI测试仪器为硬件平台,设计了基于征兆(测点)的集成推理软件平台.对征兆的测试数据(含结果)进行采集,基于序贯分类方法的数据结果,再进行故障的合理识别、推理和判断,推断出正确的结果,将故障定位在板级(即最小可更换单元).     

基于球面映射和拆卸树的拆卸序列生成算法

拆卸序列生成是虚拟维修的核心之一,直接关系到虚拟维修的可行性及成本。搜索所有可行拆卸序列、避免组合爆炸并保持算法的通用性是序列生成算法的研究难点。通过引入球面映射概念,定义了局部和全局阻碍方向及可拆卸方向,克服了传统方法中基于六坐标轴方向创建干涉矩阵的局限性。提出了一种符合拆卸规则和拆卸关系表的拆卸树生成算法,求得所有可行的拆卸序列,并通过实例在虚拟维修平台上得到了实现。     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

基于内外子区域划分的高阶精度CFD程序异构并行算法

对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法，结合结构化网格下有限差分计算和四阶龙格库塔方法的特点，引入ghost网格点区域，设计了一种ghost区域收缩计算策略，显著降低了异构计算资源之间的数据传输开销，负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠，提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数，分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)＋加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍，较MPI/OpenMP两级并行算法使用24个纯CPU核的性能，该算法使用单加速器时加速1.27倍，使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

Challenges of institutional coordination in complex defense acquisition programs: the case of the Republic of Korea’s F-X program

Decision-making in defense acquisition programs in the Republic of Korea (ROK) has been problematic, especially in highly advanced complex systems. The highly disputed force modernization program for the ROK Air Force’s fifth-generation fighter, dubbed the Fighter eXperiment, went through extreme turbulence during the type selection phase. The gist of the turbulence became evident through poor institutional coordination within the defense acquisition authorities that eventually forced them to rescind the decision generated from their own yearlong efforts, thus basically shooting themselves on the foot. The paper highlights the background of the program and reviews the institutional elements that influenced the decision-making process, and conclude that the absence of an effective coordination mechanism has made decision-making in complex defense programs even more troublesome.     

基于二次繁殖的自适应差分演化算法

分析了差分演化算法的基本原理，针对基本差分演化算法对控制参数选择敏感性强、算法后期收敛速度较慢等问题，提出了基于二次繁殖的自适应差分演化算法，并通过实验对改进算法的性能进行测试。实验结果表明，改进算法的性能优于基本差分演化算法和自适应差分演化算法。     

利用对象Petri网验证场景

序列图表示的场景常被用于系统开发早期的需求获取与描述,但因其弱语义性而难以被验证.将序列图表示的场景转换为语义精细的对象Petri网模型OPDL,并通过其仿真环境OPMSE对其进行仿真,将场景描述的系统行为"展示"给需求开发者和用户,以此进行行为需求的验证.     

排序法在某类弹药寿命分析中的应用研究

将排序法应用于无失效弹药贮存寿命试验数据的统计分析 ,介绍了排序法的基本思想 ,并计算了某类弹药的平均贮存寿命置信下界。